搜索资源列表
REManageAndNFAToDFA
- 能够完成正规式到NFA的转换，NFA到DFA的转换（子集法）,DFA的最小化，测试一个生成串是否能为生成的DFA所识别-to complete the formal ceremony to change the NFA, NFA conversion to DFA (subset), the smallest of DFA, testing whether a string of generation to generation by the DFA Recognition
zidongji
- 编译原理中的ＮＦＡ转换到ＤＦＡ（自动机的转换）-compiler principles of the NFA conversion to DFA (automatic machine translation)
NFA
- 实现NFA确定化子集算法程序。DFA是NFA的特例。对每个NFA N一定存在一个DFA Ｍ ，使得 L(M)=L(N)。对每个NFA N存在着与之等价的DFA M。从NFA的矩阵表示中可以看出，表项通常是一状态的集合，而在DFA的矩阵表示中，表项是一个状态，NFA到相应的DFA的构造的基本思路是：1.DFA的每一个状态对应NFA的一组状态. 2. DFA使用它的状态去记录在NFA读入一个输入符号后可能达到的所有状态.。-achieve NFA Number algorithm to deter
nfa_dfa
- 求正规表达式到NFA（不确定的有限自动机），NFA到DFA及DFA（有限自动机）的最小化 有注释。-seek formal expressions of the NFA (uncertain Finite Automata), the NFA to the DFA and DFA (finite state machine) is the smallest of the Notes.
Lexical
- dfa he NFA 之间的转化 非常好用啊 要是需要和我练习-dfa he NFA conversion between ah If there were to be very easy to use and I practice
TEMPLATE
- 输入正则表达式，转化为NFA,DFA，从测试文档中找出最大匹配子串-Enter the regular expression into NFA, DFA, document from the test to find out the biggest match Substring
zuodigui
- 消除文法的左递归，实现文法的化简以及NFA与DFA的转换-Elimination of left recursive grammar to achieve grammatical simplification, as well as conversion of NFA and DFA
nfatodfa
- nfa 转化为 dfa 能够运行成功，我自己已经实验过了，欢迎下载-nfa dfa able to run into a success, I have experimented with, and welcome to download
NFAtoDFA
- 给出一个NFA，用代码实现到DFA的转换，编译原理-Give an NFA, with the code to DFA conversion, compiler theory
NFA
- DFA NFA 文件生成转换 C++ 制作源码-DFA NFA file to generate source code conversion C++ production
n2d
- 实现了一个简单的nfa到dfa的转换程序，可以供初学者参考-failed to translate
nfa
- 把NFA确定化为DFA 的算法，实现将给定的NFA M，确定化为DFA M’，然后将DFA M状态最少化，将给定的DFA M的有限状态集S划分成若干互不相交的子集，使得：任何不同的两个子集中的状态都是可区别的，而同一子集中的任何两个状态都是等价的（要利用Ia函数，但并不需要构造ε-CLOSURE函数，因这是DFA）。输出化简后的DFA M’。 -NFA into a DFA to determine the algorithm to achieve a given NFA M, to det
cifafenxi
- 1、根据要求写出词法分析的正规文法G；2、根据正规文法G，写出正则式RE；3、根据正则式RE，画出NFA；4、将NFA转化为DFA；5、将DFA转化为mininum state DFA；6、mininum state DFA就是词法分析程序的流程图，根据此流程图编写相应的词法分析程序。-1, according to the lexical analysis required to write a formal grammar G 2, according to a regular gramm
DFA
- MFC实现的正规式的输入，转化为NFA,转化为DFA,转化为最简DFA的程序-use MFC to operate something about NFA
RextoNFA
- 实验正则表达式到NFA 由NFA到DFA，同时有状态表的生成-Experimental regular expression to NFA From NFA to DFA, while the state table generation
B6MHjIFh
- 编译原理实验正则表达式到NFA 由NFA到DFA，同时有状态表的生成-Experimental regular expression to NFA From NFA to DFA, while the state table generation
TFPgoodNFA
- The determination of finite automata China, NFA to DFA transformation, a good source
automata
- 有限自动机的确定华,NFA到DFA的转变,很好的源码(The determination of finite automata China, NFA to DFA transformation, a good source)
TYPKA111
- 有限自动机的确定华,NFA到DFA的转变,很好的源码(The determination of finite automata China, NFA to DFA transformation, a good source)
实验2
- 将NFA转为DFA并最小化，从excel表中读入，并输出每一步的结果，(transform NFA to DFA)